Duality for a Minimax Programming Problem Containingn-Set Functions

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimality and Duality for an Efficient Solution of Multiobjective Nonlinear Fractional Programming Problem Involving Semilocally Convex Functions

In this paper, the problem under consideration is multiobjective non-linear fractional programming problem involving semilocally convex and related functions. We have discussed the interrelation between the solution sets involving properly efficient solutions of multiobjective fractional programming and corresponding scalar fractional programming problem. Necessary and sufficient optimality...

متن کامل

Duality for the class of a multiobjective problem with support functions under $K$-$G_f$-invexity assumptions

‎In this article‎, ‎we formulate two dual models Wolfe and Mond-Weir related to symmetric nondifferentiable multiobjective programming problems‎. ‎Furthermore‎, ‎weak‎, ‎strong and converse duality results are established under $K$-$G_f$-invexity assumptions‎. ‎Nontrivial examples have also been depicted to illustrate the theorems obtained in the paper‎. ‎Results established in this paper unify...

متن کامل

Fuzzy Programming Models for Minimax Location Problem

This paper discusses the minimax location problem with fuzzy locations of customers on a plane bounded by a convex polygon under a minmax criterion. Three types of fuzzy programming are presented for this problem according to different criteria, and Euclidean distances are assumed as the scenario. For solving the proposed models, a hybrid intelligent algorithm is designed.

متن کامل

Optimality and Duality for Minimax Fractional Semi-Infinite Programming

The purpose of this paper is to consider a class of nonsmooth minimax fractional semi-infinite programming problem. Based on the concept of H − tangent derivative, a new generalization of convexity, namely generalized uniform ( , ) H B ρ − invexity, is defined for this problem. For such semi-infinite programming problem, several sufficient optimality conditions are established and proved by uti...

متن کامل

Some Duality Results in Grey Linear Programming Problem

Different approaches are presented to address the uncertainty of data and appropriate description of uncertain parameters of linear programming models. One of them is to use the grey systems theory in modeling such problem. Especially, recently, grey linear programming has attracted many researchers. In this paper, a kind of linear programming with grey coefficients is discussed. Introducing th...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Mathematical Analysis and Applications

سال: 1999

ISSN: 0022-247X

DOI: 10.1006/jmaa.1998.6187